Nested-Dissection Orderings for Sparse LU with Partial Pivoting
نویسندگان
چکیده
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilbert and Schreiber in 1980 but never implemented and tested. Like other techniques for ordering sparse matrices for LU with partial pivoting, our new method preorders the columns of the matrix (the row permutation is chosen by the pivoting sequence during the numerical factorization). Also like other methods, the column permutation Q that we select is a permutation that minimizes the fill in the Cholesky factor of Q A AQ. Unlike existing columnordering techniques, which all rely on minimum-degree heuristics, our new method is based on a nested-dissection ordering of A A. Our algorithm, however, never computes a representation of A A, which can be expensive. We only work with a representation of A itself. Our experiments demonstrate that the method is efficient and that it can reduce fill significantly relative to the best existing methods. The method reduces the LU running time on some very large matrices (tens of millions of nonzeros in the factors) by more than a factor of 2.
منابع مشابه
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several important properties. It takes a global perspective of the entire matrix, as opposed to local heuristics. It takes into account the assymetry of the input matrix by using a hypergraph to represent its structure. It is ...
متن کاملSPOOLES: An Object-Oriented Sparse Matrix Library
1 Overview Solving sparse linear systems of equations is a common and important component of a multitude of scientific and engineering applications. The SPOOLES software package1 provides this functionality with a collection of software objects and methods. The package provides a choice of three sparse matrix orderings (minimum degree, nested dissection and multisection), supports pivoting for ...
متن کاملNumerical Stability of Nested Dissection Orderings By Indu
Rigorous bounds on rounding errors for sparse positive definite matrices are obtained. When used for nested dissection orderings of finite element matrices, the analysis furnishes bounds which are stronger than those for band orderings.
متن کاملNumerical Stability of Nested Dissection Orderings
Rigorous bounds on rounding errors for sparse positive definite matrices are obtained. When used for nested dissection orderings of finite element matrices, the analysis furnishes bounds which are stronger than those for band orderings.
متن کاملComparing Nested Dissection Orderings for Parallel Sparse Matrix Factorization
In this paper we compare nested dissection orderings obtained by diierent graph bisection heuristics. In the context of parallel sparse matrix factorization the quality of an ordering is not only determined by its ll reducing capability, but also depends on the dif-culty with which a balanced mapping of the load onto the processors of the parallel computer can be found. Our analysis shows that ...
متن کامل